New results in extremal problems with polynomials

نویسنده

  • Ana Maria Acu
چکیده

In this paper we give some new results in extremal problems with polynomials which are generalization of some results of F. Locher. 2000 Mathematical Subject Classification: 26D15, 65D32 In [6] F. Locher studies some extremal problems for semidefinition polynomials (nenegative or nepositive) with the dominant coefficient equal to 1. For this he uses the quadrature formulae with high algebraical degree of exactness. Thus, using Gauss Jacobis quadrature formula, he proves: Proposition 1. For any polynomial p2m(x) ≥ 0, x ∈ [−1, 1], with the dominant coefficient equal to 1, the inequality 1 ∫ −1 (1− x)(1 + x)p2m(x)dx ≥ 2 ·m!Γ(α+m+ 1) (α+ β + 2m+ 1) ·

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orthogonal Polynomials and Quadratic Extremal Problems

The purpose of this paper is to analyse a class of quadratic extremal problems defined on various Hilbert spaces of analytic functions, thereby generalizing an extremal problem on the Dirichlet space which was solved by S.D. Fisher. Each extremal problem considered here is shown to be connected with a system of orthogonal polynomials. The orthogonal polynomials then determine properties of the ...

متن کامل

Applications of the monotonicity of extremal zeros of orthogonal polynomials in interlacing and optimization problems

We investigate monotonicity properties of extremal zeros of orthogonal polynomials depending on a parameter. Using a functional analysis method we prove the monotonicity of extreme zeros of associated Jacobi, associated Gegenbauer and q-Meixner-Pollaczek polynomials. We show how these results can be applied to prove interlacing of zeros of orthogonal polynomials with shifted parameters and to d...

متن کامل

Graph Polynomials and Graph Transformations in Algebraic Graph Theory

The thesis consists of two parts. In the first part we study two graph transformations,namely the Kelmans transformation and the generalized tree shift. In the second part of thisthesis we study an extremal graph theoretic problem and its relationship with algebraic graphtheory. The main results of this thesis are the following. • We show that the Kelmans transformation is a very ef...

متن کامل

Some polynomial extremal problems which emerged in the twentieth century

Most of the “extremal problems” of Harmonic (or Fourier) Analysis which emerged before the year 2000 were actually born in the twentieth century, and their emergences were scattered throughout that century, including the two world war periods. A great many of these problems pertain to polynomials, trigonometric polynomials and (finite) exponential sums. Writing a reasonably complete monograph o...

متن کامل

Extremal problems, inequalities, and classical orthogonal polynomials

In this survey paper we give a short account on characterizations for very classical orthogonal polynomials via extremal problems and the corresponding inequalities. Beside the basic properties of the classical orthogonal polynomials we consider polynomial inequalities of Landau and Kolmogoroff type, some weighted polynomial inequalities in L2-norm of Markov-Bernstein type, as well as the corre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005